Updating URV decompositions in parallel

Updating a Generalized URV Decomposition

An updating scheme for a quotient type generalization of a URV decomposition of two matrices is introduced. This decomposition allows low complexity updating as rows are added to two rectangular matrices, determining the dimension of three distinct subspaces. One of these subspaces is the intersection of the range space of the two matrices—information which leads to a potential application in s...

A Waveront Array for URV Decomposition Updating

On the QR algorithm and updating the SVD and URV decomposition in Parallel

A Jacobi-type updating algorithm for the SVD or URV decomposition is developed, which is related to the QR algorithm for the symmetric eigenvalue problem. The algorithm employs one-sided transformations, and therefore provides a cheap alternative to earlier developed updating algorithms based on two-sided transformations. The present algorithm as well as the corresponding systolic implementatio...

Generalized URV Subspace Tracking

The convergence rate of the Least Mean Squares (LMS) algorithm is poor whenever the adaptive lter input auto-correlation matrix is ill-conditioned. In this paper we propose a new LMS algorithm to alleviate this problem. It uses a data dependent signal transformation. The algorithm tracks the subspaces corresponding to clusters of eigenvalues of the auto-correlation matrix of the input to the ad...

Towards Parallel Repair Using Decompositions

Ontology repair remains one of the main bottlenecks for the development of ontologies for practical use. Many automated methods have been developed for suggesting potential repairs, but ultimately human intervention is required for selecting the adequate one, and the human expert might be overwhelmed by the amount of information delivered to her. We propose a decomposition of ontologies into sm...